package algorithms;

import java.util.Random;
import java.util.Scanner;

/**
 * @功能
 * @创建时间 2020/5/17
 */
public class Tesst {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String ww = scanner.next();
        int w = Integer.parseInt(ww);
        Select(w);
    }

    public static void Select(int p) {
        int[] arr = new int[p];
        Random r = new Random();
        boolean c = false;
        for (int ss = 0; ss < arr.length; ss++) {
            arr[ss] = r.nextInt(9);
        }
        int i, k, j;
        for (i = 0; i < arr.length - 2; i++) {
            for (k = i + 1; k < arr.length - 1; k++) {
                for (j = k + 1; j < arr.length; j++) {
                    if (arr[i] + arr[j] == (arr[k] * 2)) {
                        c = true;
                    }
                }
            }
        }

        while (c) {
            for (int ss = 0; ss < arr.length; ss++) {
                arr[ss] = r.nextInt(9);
            }
            int count = 0;
            for (i = 0; i < arr.length - 2; i++) {
                for (k = i + 1; k < arr.length - 1; k++) {
                    for (j = k + 1; j < arr.length; j++) {
                        if (arr[i] + arr[j] == (arr[k] * 2)) {
                            ++count;
                        }
                    }
                }
            }
            if (count == 0) {
                c = false;
            }

        }
        for (int v = 0; v < arr.length; v++) {
            System.out.println(arr[v] + "");
        }
    }
}
